Realizing the distance matrix of a graph
نویسنده
چکیده
An explicit description is giv e n for th e uniqu e gra ph with as few arcs (eac h bearin g a positive length) as pos s ibl e, whi c h has a presc rib ed mat rix of s hortest-p ath di stan ces be twee n pa irs of distinct vertices. The sam e is d one in th e case wh e n the ith diago na l matrix e ntr y, in s te ad o f be ing zero , represents th e. le ngth of a s hort est c losed path co ntainin g th e ith vertex. Ke y Word s: Graph, di s ta nce ma trix , s hortes t path. Le t G be a finite oriented graph with verti ces {Vi}~', wh e re n > 2. To avoid unn ecessary co mpli cation s, we res tric t attention to connected graph s, i. e., if i r!= j then G co ntain s a directed path from Vi to Vj. As add iti onal s tru cture, we assume associated to G a positive-valu ed fun cti on lc ass ignin g lengths lc(i, j) to the arcs (Vi, Vj) of G. The distance matrix Dc of G has e ntri es dc;(i , i) = ° on th e main diago nal; a typi c al off-diago nal e ntry dc(i, J) re pers e nts the le ngth of a s hortes t directed path in G from Vi to Vj. An arc of G is called redundant if its deletion leaves Dc un changed. Th e graph G will be called irreducible if it co ntain s no redundant arcs. A real square matrix D with e ntri es d(i , j) is called realizable if there is a grap h G s uc h that D = Dr;. Hakimi and Yau t showed that necessary and s uffi cie nt conditions for th e realiza bility of Dare The necessity of the se conditions should be clear. To prove sufficiency one need only take the arcs of G to be all (Vi. Vj) with i r!= j , and define le by le/i, J) = d(i , j) ; it follows readily from (1) to (3) that Dc= D. If matrix D is realizable, it clearly has a realization by …
منابع مشابه
Some results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملOn the spectra of reduced distance matrix of the generalized Bethe trees
Let G be a simple connected graph and {v_1,v_2,..., v_k} be the set of pendent (vertices of degree one) vertices of G. The reduced distance matrix of G is a square matrix whose (i,j)-entry is the topological distance between v_i and v_j of G. In this paper, we compute the spectrum of the reduced distance matrix of the generalized Bethe trees.
متن کاملOn Complementary Distance Signless Laplacian Spectral Radius and Energy of Graphs
Let $D$ be a diameter and $d_G(v_i, v_j)$ be the distance between the vertices $v_i$ and $v_j$ of a connected graph $G$. The complementary distance signless Laplacian matrix of a graph $G$ is $CDL^+(G)=[c_{ij}]$ in which $c_{ij}=1+D-d_G(v_i, v_j)$ if $ineq j$ and $c_{ii}=sum_{j=1}^{n}(1+D-d_G(v_i, v_j))$. The complementary transmission $CT_G(v)$ of a vertex $v$ is defined as $CT_G(v)=sum_{u in ...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملCentric connectivity index by shell matrices
Relative centricity RC values of vertices/atoms are calculated within the Distance Detour and Cluj-Distance criteria on their corresponding Shell transforms. The vertex RC distribution in a molecular graph gives atom equivalence classes, useful in interpretation of NMR spectra. Timed by vertex valences, RC provides a new index, called Centric Connectivity CC, which can be useful in the topologi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Elektronische Informationsverarbeitung und Kybernetik
دوره 12 شماره
صفحات -
تاریخ انتشار 1976